0.12/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.12/0.12	% Command    : run_E %s %d THM
0.12/0.33	% Computer : n025.cluster.edu
0.12/0.33	% Model    : x86_64 x86_64
0.12/0.33	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.33	% Memory   : 8042.1875MB
0.12/0.33	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.33	% CPULimit   : 1440
0.12/0.33	% WCLimit    : 180
0.12/0.33	% DateTime   : Thu Jul  4 05:46:24 EDT 2024
0.12/0.33	% CPUTime    : 
0.20/0.48	Running higher-order theorem proving
0.20/0.49	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.f5PDMtEh2M/E---3.1_27101.p
0.20/0.50	# Version: 3.2.0-ho
0.20/0.50	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting new_ho_10 with 900s (5) cores
0.20/0.50	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.50	# Starting sh4l with 180s (1) cores
0.20/0.50	# Starting ehoh_best_nonlift_rwall with 180s (1) cores
0.20/0.50	# sh4l with pid 27181 completed with status 0
0.20/0.50	# Result found by sh4l
0.20/0.50	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting new_ho_10 with 900s (5) cores
0.20/0.50	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.50	# Starting sh4l with 180s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HGUPS-FFSM22-SFFFFFNN
0.20/0.50	# partial match(2): HUUPS-FFSF22-SFFFFFNN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.50	# Starting new_ho_10 with 98s (1) cores
0.20/0.50	# new_ho_10 with pid 27185 completed with status 0
0.20/0.50	# Result found by new_ho_10
0.20/0.50	# Preprocessing class: HSSSSMSSSSSNFFN.
0.20/0.50	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.50	# Starting new_ho_10 with 900s (5) cores
0.20/0.50	# Starting ho_unfolding_6 with 180s (1) cores
0.20/0.50	# Starting sh4l with 180s (1) cores
0.20/0.50	# No SInE strategy applied
0.20/0.50	# Search class: HGUPS-FFSM22-SFFFFFNN
0.20/0.50	# partial match(2): HUUPS-FFSF22-SFFFFFNN
0.20/0.50	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.50	# Starting new_ho_10 with 98s (1) cores
0.20/0.50	# Preprocessing time       : 0.001 s
0.20/0.50	# Presaturation interreduction done
0.20/0.50	
0.20/0.50	# Proof found!
0.20/0.50	# SZS status Theorem
0.20/0.50	# SZS output start CNFRefutation
0.20/0.50	thf(decl_sort1, type, nat: $tType).
0.20/0.50	thf(decl_22, type, x: nat).
0.20/0.50	thf(decl_23, type, y: nat).
0.20/0.50	thf(decl_24, type, pl: nat > nat > nat).
0.20/0.50	thf(decl_25, type, esk1_0: nat).
0.20/0.50	thf(decl_26, type, esk2_0: nat).
0.20/0.50	thf(decl_27, type, esk3_0: nat).
0.20/0.50	thf(decl_28, type, esk4_0: nat).
0.20/0.50	thf(satz7, axiom, ![X1:nat, X2:nat]:(((X2)!=(pl @ X1 @ X2))), file('/export/starexec/sandbox/tmp/tmp.f5PDMtEh2M/E---3.1_27101.p', satz7)).
0.20/0.50	thf(satz9b, conjecture, ~((~(~(((~(![X3:nat]:(((x)!=(pl @ y @ X3))))=>~(~(![X3:nat]:(((y)!=(pl @ x @ X3))))))=>~((((x)!=(y))<=~(![X3:nat]:(((y)!=(pl @ x @ X3)))))))))<=(~(~(![X3:nat]:(((x)!=(pl @ y @ X3)))))<=((x)=(y))))), file('/export/starexec/sandbox/tmp/tmp.f5PDMtEh2M/E---3.1_27101.p', satz9b)).
0.20/0.50	thf(satz6, axiom, ![X1:nat, X2:nat]:(((pl @ X1 @ X2)=(pl @ X2 @ X1))), file('/export/starexec/sandbox/tmp/tmp.f5PDMtEh2M/E---3.1_27101.p', satz6)).
0.20/0.50	thf(satz5, axiom, ![X1:nat, X2:nat, X4:nat]:(((pl @ (pl @ X1 @ X2) @ X4)=(pl @ X1 @ (pl @ X2 @ X4)))), file('/export/starexec/sandbox/tmp/tmp.f5PDMtEh2M/E---3.1_27101.p', satz5)).
0.20/0.50	thf(c_0_4, plain, ![X1:nat, X2:nat]:(((X2)!=(pl @ X1 @ X2))), inference(fof_simplification,[status(thm)],[satz7])).
0.20/0.50	thf(c_0_5, negated_conjecture, ~(~(((((x)=(y))=>~(~(![X3:nat]:(((x)!=(pl @ y @ X3))))))=>~(~(((~(![X3:nat]:(((x)!=(pl @ y @ X3))))=>~(~(![X3:nat]:(((y)!=(pl @ x @ X3))))))=>~((~(![X3:nat]:(((y)!=(pl @ x @ X3))))=>((x)!=(y)))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz9b])])).
0.20/0.50	thf(c_0_6, plain, ![X18:nat, X19:nat]:(((X19)!=(pl @ X18 @ X19))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_4])])).
0.20/0.50	thf(c_0_7, plain, ![X27:nat, X28:nat]:(((pl @ X27 @ X28)=(pl @ X28 @ X27))), inference(variable_rename,[status(thm)],[satz6])).
0.20/0.50	thf(c_0_8, negated_conjecture, ((((((y)=(pl @ x @ esk4_0))|((x)=(pl @ y @ esk2_0))|((x)=(y)))&(((x)=(y))|((x)=(pl @ y @ esk2_0))|((x)=(y))))&((((y)=(pl @ x @ esk4_0))|((y)=(pl @ x @ esk3_0))|((x)=(y)))&(((x)=(y))|((y)=(pl @ x @ esk3_0))|((x)=(y)))))&(((((y)=(pl @ x @ esk4_0))|((x)=(pl @ y @ esk2_0))|((x)=(pl @ y @ esk1_0)))&(((x)=(y))|((x)=(pl @ y @ esk2_0))|((x)=(pl @ y @ esk1_0))))&((((y)=(pl @ x @ esk4_0))|((y)=(pl @ x @ esk3_0))|((x)=(pl @ y @ esk1_0)))&(((x)=(y))|((y)=(pl @ x @ esk3_0))|((x)=(pl @ y @ esk1_0)))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])).
0.20/0.50	thf(c_0_9, plain, ![X2:nat, X1:nat]:(((X1)!=(pl @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_6])).
0.20/0.50	thf(c_0_10, plain, ![X2:nat, X1:nat]:(((pl @ X1 @ X2)=(pl @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_7])).
0.20/0.50	thf(c_0_11, negated_conjecture, (((x)=(y))|((x)=(pl @ y @ esk2_0))|((x)=(y))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.50	thf(c_0_12, plain, ![X2:nat, X1:nat]:(((pl @ X1 @ X2)!=(X1))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.20/0.50	thf(c_0_13, negated_conjecture, (((y)=(pl @ x @ esk4_0))|((x)=(pl @ y @ esk2_0))|((x)=(pl @ y @ esk1_0))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.50	thf(c_0_14, plain, ![X24:nat, X25:nat, X26:nat]:(((pl @ (pl @ X24 @ X25) @ X26)=(pl @ X24 @ (pl @ X25 @ X26)))), inference(variable_rename,[status(thm)],[satz5])).
0.20/0.50	thf(c_0_15, negated_conjecture, (((y)=(x))|((x)=(pl @ y @ esk2_0))), inference(cn,[status(thm)],[c_0_11])).
0.20/0.50	thf(c_0_16, negated_conjecture, ((x)!=(y)), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(local_rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13])]), c_0_12]), c_0_12])).
0.20/0.50	thf(c_0_17, negated_conjecture, (((x)=(y))|((y)=(pl @ x @ esk3_0))|((x)=(y))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.20/0.50	thf(c_0_18, plain, ![X1:nat, X2:nat, X3:nat]:(((pl @ (pl @ X1 @ X2) @ X3)=(pl @ X1 @ (pl @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.50	thf(c_0_19, negated_conjecture, ((pl @ y @ esk2_0)=(x)), inference(sr,[status(thm)],[c_0_15, c_0_16])).
0.20/0.50	thf(c_0_20, negated_conjecture, (((y)=(x))|((y)=(pl @ x @ esk3_0))), inference(cn,[status(thm)],[c_0_17])).
0.20/0.50	thf(c_0_21, negated_conjecture, ![X1:nat]:(((pl @ y @ (pl @ esk2_0 @ X1))=(pl @ x @ X1))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.20/0.50	thf(c_0_22, negated_conjecture, ((pl @ x @ esk3_0)=(y)), inference(sr,[status(thm)],[c_0_20, c_0_16])).
0.20/0.50	thf(c_0_23, negated_conjecture, ![X1:nat]:(((pl @ x @ X1)!=(y))), inference(spm,[status(thm)],[c_0_12, c_0_21])).
0.20/0.50	thf(c_0_24, negated_conjecture, ($false), inference(sr,[status(thm)],[c_0_22, c_0_23]), ['proof']).
0.20/0.50	# SZS output end CNFRefutation
0.20/0.50	# Parsed axioms                        : 9
0.20/0.50	# Removed by relevancy pruning/SinE    : 0
0.20/0.50	# Initial clauses                      : 16
0.20/0.50	# Removed in clause preprocessing      : 5
0.20/0.50	# Initial clauses in saturation        : 11
0.20/0.50	# Processed clauses                    : 37
0.20/0.50	# ...of these trivial                  : 0
0.20/0.50	# ...subsumed                          : 9
0.20/0.50	# ...remaining for further processing  : 28
0.20/0.50	# Other redundant clauses eliminated   : 0
0.20/0.50	# Clauses deleted for lack of memory   : 0
0.20/0.50	# Backward-subsumed                    : 3
0.20/0.50	# Backward-rewritten                   : 3
0.20/0.50	# Generated clauses                    : 63
0.20/0.50	# ...of the previous two non-redundant : 54
0.20/0.50	# ...aggressively subsumed             : 0
0.20/0.50	# Contextual simplify-reflections      : 0
0.20/0.50	# Paramodulations                      : 60
0.20/0.50	# Factorizations                       : 0
0.20/0.50	# NegExts                              : 0
0.20/0.50	# Equation resolutions                 : 0
0.20/0.50	# Disequality decompositions           : 0
0.20/0.50	# Total rewrite steps                  : 16
0.20/0.50	# ...of those cached                   : 3
0.20/0.50	# Propositional unsat checks           : 0
0.20/0.50	#    Propositional check models        : 0
0.20/0.50	#    Propositional check unsatisfiable : 0
0.20/0.50	#    Propositional clauses             : 0
0.20/0.50	#    Propositional clauses after purity: 0
0.20/0.50	#    Propositional unsat core size     : 0
0.20/0.50	#    Propositional preprocessing time  : 0.000
0.20/0.50	#    Propositional encoding time       : 0.000
0.20/0.50	#    Propositional solver time         : 0.000
0.20/0.50	#    Success case prop preproc time    : 0.000
0.20/0.50	#    Success case prop encoding time   : 0.000
0.20/0.50	#    Success case prop solver time     : 0.000
0.20/0.50	# Current number of processed clauses  : 12
0.20/0.50	#    Positive orientable unit clauses  : 4
0.20/0.50	#    Positive unorientable unit clauses: 1
0.20/0.50	#    Negative unit clauses             : 7
0.20/0.50	#    Non-unit-clauses                  : 0
0.20/0.50	# Current number of unprocessed clauses: 32
0.20/0.50	# ...number of literals in the above   : 42
0.20/0.50	# Current number of archived formulas  : 0
0.20/0.50	# Current number of archived clauses   : 16
0.20/0.50	# Clause-clause subsumption calls (NU) : 40
0.20/0.50	# Rec. Clause-clause subsumption calls : 35
0.20/0.50	# Non-unit clause-clause subsumptions  : 4
0.20/0.50	# Unit Clause-clause subsumption calls : 25
0.20/0.50	# Rewrite failures with RHS unbound    : 0
0.20/0.50	# BW rewrite match attempts            : 22
0.20/0.50	# BW rewrite match successes           : 22
0.20/0.50	# Condensation attempts                : 37
0.20/0.50	# Condensation successes               : 0
0.20/0.50	# Termbank termtop insertions          : 1074
0.20/0.50	# Search garbage collected termcells   : 155
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.005 s
0.20/0.50	# System time              : 0.002 s
0.20/0.50	# Total time               : 0.007 s
0.20/0.50	# Maximum resident set size: 1796 pages
0.20/0.50	
0.20/0.50	# -------------------------------------------------
0.20/0.50	# User time                : 0.008 s
0.20/0.50	# System time              : 0.002 s
0.20/0.50	# Total time               : 0.010 s
0.20/0.50	# Maximum resident set size: 1716 pages
0.20/0.50	% E---3.1 exiting
0.20/0.50	% E exiting
0.20/0.50	EOF